Search Results
STOC 2021 - Gödel Prize talk: Complexity Dichotomies for Counting CSPs
STOC 2021 - Pseudodeterministic Algorithms and the Structure of Probabilistic Time
STOC 2021 - Knuth Prize talk: Logic and Computation – A Match Made in Heaven
STOC 2021 - The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
STOC 2021 - Best Papers
Andrei Bulatov "On the Complexity of CSP-based Ideal Membership Problems" | Big Seminar
The Classification Program for Counting Problems II
Tim Roughgarden: Gödel Prize Winner and Trailblazer from Algorithmic Game Theory to EIP-1559
A Complete Dichotomy Rises from the Capture of Vanishing Signatures - Jin-Yi Cai
A3A.1 Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1
Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree Graphs
Counting Matrix Partitions of Graphs
